ChromoVis: Feature-Rich Layouts of Chromosome Conformation Graphs

نویسندگان

  • Darya Filippova
  • Geet Duggal
  • Rob Patro
  • Carl Kingsford
  • G. Duggal
  • R. Patro
  • C. Kingsford
چکیده

Recent chromosome conformation capture (3C) experiments produce pairwise interactions between fragments of DNA that are spatially close in the nucleus of a cell. Visualizing 3C data on the scale of the whole genome allows scientists to gain insight into chromosomal packing in the nucleus of a cell and to generate hypotheses about what kinds of genomic features (e.g. gene locations, DNA accessibility, GC content) correlate with spatial proximity. We introduce the chromosome layout problem which seeks a two-dimensional layout of a chromosome conformation graph such that: (1) an entire chromosome can be visualized as a strand of DNA together with its genomic features, and (2) pairwise spatial constraints obtained from biological experiments are respected as much as possible. Our approach treats the chromosome as a self-avoiding string or polymer while attempting to satisfy the constraints. The layouts we produce accurately depict spatial proximities observed in 3C experiments while avoiding undesirable occlusions and minimizing edge crossings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pathfinder: Visual Analysis of Paths in Graphs

The analysis of paths in graphs is highly relevant in many domains. Typically, path-related tasks are performed in node-link layouts. Unfortunately, graph layouts often do not scale to the size of many real world networks. Also, many networks are multivariate, i.e., contain rich attribute sets associated with the nodes and edges. These attributes are often critical in judging paths, but directl...

متن کامل

Track Layouts, Layered Path Decompositions, and Leveled Planarity

We investigate two types of graph layouts, track layouts and layered path decompositions, and the relations between their associated parameters track-number and layered pathwidth. We use these two types of layouts to characterize leveled planar graphs, the graphs with planar layered drawings with no dummy vertices. It follows from the known NP-completeness of leveled planarity that track-number...

متن کامل

TopoLayout: Graph Layout by Topological Features

We describe a new multi-level algorithm to draw graphs based on the topological features they contain. Topological features are recursively detected and their subgraphs are collapsed into single nodes, forming a graph hierarchy. Once the hierarchy is computed, we draw the subgraphs of the hierarchy, using an appropriate algorithm for each topological feature. Our layout algorithms are areaaware...

متن کامل

VLSI Layouts of Complete Graphs and Star Graphs

In this paper, we present efficient layouts for complete graphs and star graphs. We show that an N-node complete graph can be optimally laid out using LN2/4] tracks for a colinear layout, and can be laid out in N4/16 + o(N4) area for a 2D layout. We also show that an N-node star graph can be laid out in N2/16 + o(N2) area, which is smaller than any possible layout of a similar-size hypercube. T...

متن کامل

Topological Consistency Checking and Refinement of Network-based Space Layouts

Network-based space layouts are fine-grained models of architectural spaces. They include rich spatial relationships between layout elements. Such information tends to be limited in existing space representations in building information modeling (BIM) systems. Network-based space layouts could be useful in the space planning and building automation domains. Their main feature is a geometric net...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013